Small deterministic Turing machines
نویسندگان
چکیده
منابع مشابه
Small Universal Turing Machines
Let UTM(m,n) be the class of universal Turing machine with m states and n symbols. Universal Turing machines are proved to exist in the following classes: UTM(24,2), UTM( 10,3), UTM(7,4), UTM(5,5), UTM(4,6), UTM(3,lO) and UTM(2,18).
متن کاملFour Small Universal Turing Machines
We present small polynomial time universal Turing machines with state-symbol pairs of (5, 5), (6, 4), (9, 3) and (18, 2). These machines simulate our new variant of tag system, the bi-tag system and are the smallest known universal Turing machines with 5, 4, 3 and 2-symbols respectively. Our 5-symbol machine uses the same number of instructions (22) as the smallest known universal Turing machin...
متن کاملSmall fast universal Turing machines
We present a number of time-efficient small universal Turing machines. We show that there exists deterministic polynomial time universal Turing machines with state-symbol products of (3, 11), (5, 7), (6, 6), (7, 5) and (8, 4). These machines are the smallest known universal Turing machines that simulate TMs in polynomial time.
متن کاملSmall Turing universal signal machines
Computation and universality have been defined in the 1930’s. In the last five or so decades, it has been unveiled how common they are. The question about the frontier moved from proving the universality of dynamical systems to the complexity of universal machines. This is not only an intellectual challenge, but also important to find niches escaping tons of non decidability results or otherwis...
متن کاملSmall Weakly Universal Turing Machines
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeated word to the left of their input and another to the right. They simulate Rule 110 and are currently the smallest known weakly universal Turing machines. Despite their small size these machines are efficient polynomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00078-3